Extra Resource Allocation Problem with the Most Compromise Common Weights Based on DEA∗

In this paper, we propose a method for the extra resource allocation problem based on data envelopment analysis (DEA). Suppose there are some extra resource such as bonus or material benefits, which can be given to all or only a part of decision making units (DMUs), and if we want the allocation to be most beneficial to the whole system, how the extra resource should be distributed. Since the selection of DMUs to receive the extra resource should depend on not only its efficiency, but also its scale, this extra resource allocation problem is complicated to be solved. We construct an improved Common Weights Analysis (CWA) model to obtain common weights for the full ranking. Adopting the common weights, we propose an algorithm for the extra resource allocation problem. The extra resource allocation we proposed is regarded as the most compromise solution.